Gradient-Informed Basis Adaptation for Legendre Chaos Expansions
نویسندگان
چکیده
منابع مشابه
Gradient dynamic optimization with Legendre chaos
The polynomial chaos approach for stochastic simulation is applied to trajectory optimization, by conceptually replacing random variables with free variables. Using the gradient method, we generate with low computational cost an accurate parametrization of optimal trajectories.
متن کاملRepresentation of sparse Legendre expansions
We derive a new deterministic algorithm for the computation of a sparse Legendre expansion f of degree N with M N nonzero terms from only 2M function resp. derivative values f (1), j = 0, . . . , 2M − 1 of this expansion. For this purpose we apply a special annihilating filter method that allows us to separate the computation of the indices of the active Legendre basis polynomials and the evalu...
متن کاملpolynomial chaos expansions KEVIN
Submitted for the MAR13 Meeting of The American Physical Society Simulation of stochastic quantum systems using polynomial chaos expansions KEVIN YOUNG, MATTHEW GRACE, Sandia National Laboratories — We present an approach to the simulation of quantum systems driven by classical stochastic processes that is based on the polynomial chaos expansion, a well-known technique in the field of uncertain...
متن کاملReconstruction of sparse Legendre and Gegenbauer expansions
Recently the reconstruction of sparse trigonometric polynomials has attained much attention. There exist recovery methods based on random sampling related to compressed sensing (see e.g. [17, 10, 5, 4] and the references therein) and methods based on deterministic sampling related to Prony–like methods (see e.g. [15] and the references therein). Both methods are already generalized to other pol...
متن کاملSparse Legendre expansions via l1-minimization
We consider the problem of recovering polynomials that are sparse with respect to the basis of Legendre polynomials from a small number of random samples. In particular, we show that a Legendre s-sparse polynomial of maximal degree N can be recovered fromm s log(N) random samples that are chosen independently according to the Chebyshev probability measure dν(x) = π−1(1 − x2)−1/2dx. As an effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Verification, Validation and Uncertainty Quantification
سال: 2018
ISSN: 2377-2158,2377-2166
DOI: 10.1115/1.4040802